Lock-free Transactions for Real-time Systems
ثبت نشده
چکیده
We show that previous algorithmic and scheduling work concerning the use of lock-free objects in hard real-time systems can be extended to support real-time transactions on memory-resident data. Using our approach, transactions are not susceptible to priority inversion or deadlock, do not require complicated mechanisms for rolling back aborted transactions, and can be implemented as library routines that require no special kernel support.
منابع مشابه
Lock-Free Transactions for Real-Time Systems
We show that previous algorithmic and scheduling work concerning the use of lock-free objects in hard real-time systems can be extended to support real-time transactions on memory-resident data. Using our approach, transactions are not susceptible to priority inversion or deadlock, do not require complicated mechanisms for data-logging or for rolling back aborted transactions, and are implement...
متن کاملA framework for implementing objects and scheduling tasks in lock-free real-time systems
We present an integrated framework for developing realtime systems in which lock-free algorithms are employed to implement shared objects. There are two key objectives of our work. The first is to enable functionality for object sharing in lock-free real-time systems that is comparable to that in lock-based systems. Our main contribution toward this objective is an efficient approach for implem...
متن کاملCombined Locking Approach for Scheduling Hard Real-Time Transactions in Real-Time Databases
Previous work has shown the superiority of the optimistic protocols over the lock-based protocols for scheduling soft or firm real-time transactions. However, optimistic protocols cannot provide schedulability analysis for hard real-time transactions because of uncertain transaction restarts. In this paper, we develop new combined locking approach for using optimistic concurrency control to sch...
متن کاملLocking Based Concurrency Control for Integrated Real-Time Database Systems
In many database applications, incoming transactions are a mixed load of conventional (non real-time) and real-time (typically soft and rm) transactions. In this environment, transactions can even be changed dynamically from non real-time to soft or rm, or from soft to rm deadline transactions according to their execution paths. In this paper we show how lock based approach can handle these sit...
متن کاملA Lock-Free Approach to Object Sharing in Real-Time Systems
This work aims to establish the viability of lock-free object sharing in uniprocessor real-time systems. Naive usage of conventional lock-based object-sharing schemes in realtime systems leads to unbounded priority inversion. A priority inversion occurs when a task is blocked by a lower-priority task that is inside a critical section. Mechanisms that bound priority inversion usually entail kern...
متن کامل